gradient projection造句
例句與造句
- General gradient projection method of interior points for linear coustrained optimization
一個(gè)求解線性不等式約束的非線性規(guī)劃的廣義梯度投影內(nèi)點(diǎn)算法 - Generalized three term - memory gradient projection method for nonlinear programming with nonlinear equality and inequality constraints
求解非線性等式和不等式約束優(yōu)化問(wèn)題的三項(xiàng)記憶梯度廣義投影算法 - Some convergence results of the gradient projection in method under milder conditions are obtained . finally we conclude the dissertation with some remarks in chapter 6
第六章是結(jié)論部分，主要對(duì)本論文的內(nèi)容作了簡(jiǎn)單的概括和分析。 - Then based on the gradient projection method , the gradient projection direction is deduced . the gradient direction is the base for sensitivity analysis
接著，根據(jù)投影梯度法，推導(dǎo)出了投影梯度方向，該梯度方向是靈敏度分析的基礎(chǔ)。 - Chapter 2 , using the technique of ( e , d ) generalized gradient projection and the idea of strongly subfeasible directions , several new algorithms for systems of nonlinear inequations are presented
第二章，利用( ， )廣義梯度投影技術(shù)和強(qiáng)次可行方向法思想，建立了非線性不等式組的廣義梯度投影算法。 - It's difficult to find gradient projection in a sentence. 用gradient projection造句挺難的
- In chapter 2 . we give a class of new algorithms for nonlinear programming problems with linear constrained by combining the gradient projection method with non - quasi - newton method which was given in paper [ 2 ] . it ' s global convergence and the superlinear convergence are proved under suitable conditions
在第二章中我們將梯度投影與文[ 2 ]中的非擬牛頓法相結(jié)合，給出了求解線性約束非線性優(yōu)化問(wèn)題的一類梯度投影非擬牛頓算法。 - According to the geometry model constructed in this paper , kinematics analysis , inverse kinematics with its optimization , analysis and calculation of dynamics are introduced . the resolution of matrix reverse transformation and gradient projection based on fake reverse matrix are used in the computation
建立了該手腕的幾何模型,針對(duì)該模型展開(kāi)了運(yùn)動(dòng)學(xué)分析、逆運(yùn)動(dòng)學(xué)解的計(jì)算,計(jì)算使用了矩陣逆變換的解析法和基于偽逆陣的梯度投影法兩種方法。 - 2 both least mean - square ( lms ) and least - square ( ls ) blind space - time receivers methods based on the rosen ' s gradient projection are presented for space - time receiver that merge with the idea of smart antenna , and combined with the different data - selected schemes . the effect of these schemes on the computational complexity of two detection methods is analyzed . the simulations illustrate that those methods are effective
2 、針對(duì)將智能天線的思想融入其中的空時(shí)接收機(jī)，提出了基于rosen梯度投影實(shí)現(xiàn)的最小均方( lms )與最小二乘盲空時(shí)接收機(jī)算法并將提出的不同數(shù)據(jù)方案結(jié)合起來(lái)，分析了提出的方案對(duì)每次迭代運(yùn)算的運(yùn)算量的影響，通過(guò)仿真實(shí)驗(yàn)驗(yàn)證了方法的有效性。 - 3 a novel recursive least - square ( rls ) blind space - time receiver algorithm based on the constrained condition , which can completely avoid the matrix inversion introduced into by constraints ( comparing with the normal rls ) , is proposed for multi - path slow fading cdma channels . the computational complexity of this method is not only lower than that of the normal rls , but also lower than that of both lms and ls blind space - time receiver methods that are realized based on the rosen ' s gradient projection . and the speed of convergence of the presented rls blind space - time receiver algorithm is better than that of both lms and ls blind space - time receiver methods
3 、針對(duì)多徑慢衰落信道下ds - cdma盲空時(shí)接收機(jī)中線性約束二次規(guī)劃問(wèn)題提出一種新的遞歸最小二乘算法，該算法完全避免因約束而引進(jìn)的矩陣求逆運(yùn)算(相對(duì)于常規(guī)的遞歸最小二乘算法) ，不但運(yùn)算量比常規(guī)的要低，而且比基于rosen梯度投影實(shí)現(xiàn)的最小均方( lms )與最小二乘盲空時(shí)接收機(jī)算法還低，且收斂速度比基于rosen梯度投影實(shí)現(xiàn)的最小均方( lms )與最小二乘盲空時(shí)多用戶檢測(cè)都好，將提出的新的遞歸最小二乘算法與提出的數(shù)據(jù)選擇方案結(jié)合起來(lái)可以進(jìn)一步降低其運(yùn)算量，具有很大的實(shí)用價(jià)值，最后通過(guò)仿真實(shí)驗(yàn)進(jìn)一步分析了其性能。 - Used perturbed method and making inexact generalized gradient projection with cone , perturbed generalized gradient projection method is proposed . the field of the algorithm is extended . numerical experiments show that the method is effective . secondly , using the trust region form and the pseudo - directional derivative of minimax problem , we propose the trust region form of minimax problem
對(duì)信賴域法作了進(jìn)一步的研究，借助minimax問(wèn)題的偽方向?qū)?shù)，構(gòu)造出其信賴域二次模型，并結(jié)合非單調(diào)策略，給出求解minimax問(wèn)題的簡(jiǎn)單易行的信賴域算法。 - In chapter 5 , the authors study the convergence properties of the gradient projection method for the constrained optimization problem . in this chapter , a new step - size rule , which avoids fulfiling the classical line search and includes choosing a constant as the step size as a special case , is presented and analyzed
第五章研究了求解約束最優(yōu)化問(wèn)題的梯度投影方法，在步長(zhǎng)的選取時(shí)采用了一種新的策略，這種策略不需要進(jìn)行傳統(tǒng)的線搜索且包含步長(zhǎng)取常數(shù)這種特例，在較弱的條件下，證明了梯度投影方法的全局收斂性。